Closure lattices
نویسنده
چکیده
Closure spaces have been previously investigated by Paul Edelman and Robert Jami-son as \convex geometries". Consequently, a number of the results given here duplicate theirs. However, we employ a slightly diierent, but equivalent, deening axiom which gives a new avor to our presentation. The major contribution is the deenition of a partial order on all subsets, not just closed (or convex) subsets. It is shown that the subsets of a closure space, so ordered, form a lattice with regular, though non-modular, properties. Investigation of this lattice becomes our primary focus.
منابع مشابه
Distributive Lattices of λ-simple Semirings
In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left $k$-radicals $Lambda(a)={x in S | a stackrel{l}{longrightarrow^{infty}} x}$ induced by the transitive closure $stackrel{l}{longrightarrow^{infty}}$ of the relation $stackrel{l}{longrightarrow}$ which induce the equivalence relation $lambda$. Again non-transit...
متن کاملSome lattices of closure systems on a finite set
In this paper we study two lattices of significant particular closure systems on a finite set, namely the union stable closure systems and the convex geometries. Using the notion of (admissible) quasi-closed set and of (deletable) closed set we determine the covering relation ≺ of these lattices and the changes induced, for instance, on the irreducible elements when one goes from C to C ′ where...
متن کاملDirect Product Decompositions of Lattices , Closures andRelation
In this paper we study the direct product decompositions of closure operations and lattices of closed sets. We characterize the direct product decompositions of lattices of closed sets in terms of closure operations, and nd those decompositions of lattices which correspond to the decompositions of closures. If a closure on a nite set is represented by its implication base (i.e. a binary relatio...
متن کاملOn closure axioms for a matroid using Galois connections∗
We present two systems of closure axioms for a matroid with the assistance of Galois connections. These axioms give a mathematical foundation for the connections between matroids, Galois connections and concept lattices. We deal with some relationship between matroids and geometric lattices by the above axioms. We also discuss some applications between matroids and concept lattices with the abo...
متن کاملClosure operators on sets and algebraic lattices
Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such as group, ring, field, lattice, vector space, etc., taking the substructure generated by a set, i.e., the least substructure which includes that set, is a closure operator. Given a binary relation, taking the relation with certain properties, such as reflexive, transitive, equivalence, etc...
متن کاملDirect product decompositions of lattices, closures and relation schemes
In this paper we study direct product decompositions of closure operations and lattices of closed sets. We characterize direct product decompositions of lattices of closed sets in terms of closure operations, and find those decompositions of lattices which correspond to the decompositions of closures. If a closure on a finite set is represented by its implication base (i.e. a binary relation on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 154 شماره
صفحات -
تاریخ انتشار 1996